Locating fixed points in the phase plane
نویسندگان
چکیده
منابع مشابه
Projectivities with Fixed Points on Every Line of the Plane
The system of fixed elements of a projectivity contains with any two points the line connecting them and with any two lines their intersection. It is, therefore, in its structure very much like a subplane of the plane under consideration ; and thus one may expect the structure of the projectivity to be dominated by the structure of the system of its fixed elements, provided this system is not "...
متن کاملLocating least-distant lines in the plane
In this paper we deal with locating a line in the plane. If d is a distance measure our objective is to nd a straight line l which minimizes f(l) = M X m=1 w m d(Ex m ; l) or g(l) = max respectively, where w m 0 are non-negative weights, Ex m = (a m1 ; a m2); m = 1; : : : ; M are the M existing facilities represented by points in the plane and d(Ex m ; l) = min P2l d(Ex m ; P) is the distance f...
متن کاملRadial Points in the Plane
A radial point for a nite set P in the plane is a point q 6 2 P with the property that each line connecting q to a point of P passes through at least one other element of P. We prove a conjecture of Pinchasi, by showing that the number of radial points for a non-collinear n-element set P is O(n). We also present several extensions of this result, generalizing theorems of Beck, Szemer edi and Tr...
متن کاملDiagonal arguments and fixed points
A universal schema for diagonalization was popularized by N.S. Yanofsky (2003), based on a pioneering work of F.W. Lawvere (1969), in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function. It was shown that many self-referential paradoxes and diagonally proved theorems can fit in that schema. Here, we fi...
متن کاملThree-clustering of Points in the Plane Three-clustering of Points in the Plane
Given n points in the plane, we partition them into three classes such that the maximum distance between two points in the same class is minimized. The algorithm takes O(n log n) time.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2019
ISSN: 2470-0045,2470-0053
DOI: 10.1103/physreve.100.052146